1360C - Similar Pairs - CodeForces Solution

constructive algorithms graph matchings greedy sortings *1100

Please click on ads to support us..

Python Code: 

m=int(input())
for t in range(m):
	n=int(input())
	a=list(map(int,input().split()))
	a.sort()
	f=0
	if sum(a)%2==0:
		f=1
	else:
		for i in range(n-1):
			if abs(a[i]-a[i+1])==1:
				f=1
				break
	print("YES" if f==1 else "NO")

C++ Code: 

#include <bits/stdc++.h>

using namespace std;

int main()
{
    int t, a,b,c;
    
    cin>>t;
    
    while(t--)
    {
        cin>>a;
        
        int n[a];
        int ev=0;
        
        for(int i=0;i<a;i++){
            cin>>n[i];
            
            if(n[i]%2==0)
            {
                ev++;
            }
        }
        
        if(ev%2==0)
            cout<<"YES"<<"\n";
        
        else{
            sort(n,n+a);
        
            int min=0;
        
            for(int i=0;i<(a-1);i++)
            {
                if((n[i+1]-n[i])==1){
                    min=1;
                    break;
                }
            }
            
            if(min==1)
                 cout<<"YES"<<"\n";
            
            else
                cout<<"NO"<<"\n";
        }
    }
}


Comments

Submit
0 Comments
More Questions

1091A - New Year and the Christmas Ornament
1352B - Same Parity Summands
1102A - Integer Sequence Dividing
630B - Moore's Law
1004A - Sonya and Hotels
1680B - Robots
1690A - Print a Pedestal (Codeforces logo)
1295A - Display The Number
1077A - Frog Jumping
1714G - Path Prefixes
1369C - RationalLee
289B - Polo the Penguin and Matrix
1716A - 2-3 Moves
1670B - Dorms War
1716B - Permutation Chain
987A - Infinity Gauntlet
1676G - White-Black Balanced Subtrees
1716D - Chip Move
1352F - Binary String Reconstruction
1487B - Cat Cycle
1679C - Rooks Defenders
56A - Bar
1694B - Paranoid String
35A - Shell Game
1684A - Digit Minimization
43B - Letter
1017A - The Rank
1698B - Rising Sand
235A - LCM Challenge
1075B - Taxi drivers and Lyft